AlgoWiki

Generating function

A generating function is a formal power series where the coefficient at xnx^n usually counts the number of combinatorial objects of size nn

Sometimes the coefficients are normalized, as is the case with exponential generating functions, where the nnth coefficient is divided by n!n!. This can give the operations on the series a different meaning.

Problems

See also